Clustering Large Attributed Graph

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

I-Louvain: An Attributed Graph Clustering Method

Modularity allows to estimate the quality of a partition into communities of a graph composed of highly inter-connected vertices. In this article, we introduce a complementary measure, based on inertia, and specially conceived to evaluate the quality of a partition based on real attributes describing the vertices. We propose also I-Louvain, a graph nodes clustering method which uses our criteri...

متن کامل

Multi-Attributed Graph Matching: a Spectral Clustering Approach

We present a Multiple Attribute Graph (MARG) Matching algorithm. The algorithm operates on a strong product graph, where vertices correspond to hypothesized matchings between two nodes and edges specify compatibilities between two matches. We show how the matching problem reduces to partitioning the strong product graph, which we solve with spectral clustering. We test our algorithm on a few im...

متن کامل

Symbolic Attributed Graphs for Attributed Graph Transformation

In this paper we present a new approach to deal with attributed graphs and attributed graph transformation. This approach is based on working with what we call symbolic graphs, which are graphs labelled with variables together with a formula that constrains the possible values that we may assign to these variables. In particular, in this paper we will compare in detail this new approach with th...

متن کامل

Distributing Attributed Graph Transformation

In this work we consider the question how attributed graph transformation can be distributed over a network. Among several attribution concepts for graph transformation in the literature we choose the description of data and data operations by partial algebras leading to a powerful and exible attribution of graph transformation. Distributing it over a network, the communication between network ...

متن کامل

Attributed Context-Sensitive Graph Grammars

The paper introduces a concept of attributed context-sensitive graph grammars. The graph grammars are a graphical generalization of the textual grammars and can thus be used to specify the syntax of graphical programming or modeling languages. The attributed graph grammars extend the basic graph grammars with definitions of attributes and the associated attribute evaluation rules. By analogy to...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Information Processing

سال: 2012

ISSN: 1882-6652

DOI: 10.2197/ipsjjip.20.806